Label-Enhanced Graph Neural Network for Semi-Supervised Node Classification
نویسندگان
چکیده
Graph Neural Networks (GNNs) have been widely applied in the semi-supervised node classification task, where a key point lies how to sufficiently leverage limited but valuable label information. Most of classical GNNs solely use known labels for computing loss at output. In recent years, several methods designed additionally utilize input. One part augment features via concatenating or adding them with one-hot encodings labels, while other optimize graph structure by assuming neighboring nodes tend same label. To bring into full play rich information this paper, we present label-enhanced learning framework GNNs, which first models each as virtual center intra-class and then jointly learns representations both labels. Our approach could not only smooth belonging class, also explicitly encode semantics process GNNs. Moreover, training selection technique is provided eliminate potential leakage issue guarantee model generalization ability. Finally, an adaptive self-training strategy proposed iteratively enlarge set more reliable pseudo distinguish importance pseudo-labeled during process. Experimental results on real-world synthetic datasets demonstrate our can consistently outperform state-of-the-arts, effectively nodes.
منابع مشابه
A neural network algorithm for semi-supervised node label learning from unbalanced data
Given a weighted graph and a partial node labeling, the graph classification problem consists in predicting the labels of all the nodes. In several application domains, from gene to social network analysis, the labeling is unbalanced: for instance positive labels may be much less than negatives. In this paper we present COSNet (COst Sensitive neural Network), a neural algorithm for predicting n...
متن کاملGraph Partition Neural Networks for Semi-Supervised Classification
We present graph partition neural networks (GPNN), an extension of graph neural networks (GNNs) able to handle extremely large graphs. GPNNs alternate between locally propagating information between nodes in small subgraphs and globally propagating information between the subgraphs. To efficiently partition graphs, we experiment with several partitioning algorithms and also propose a novel vari...
متن کاملSemi-supervised Learning for Multi-label Classification
In this report we consider the semi-supervised learning problem for multi-label image classification, aiming at effectively taking advantage of both labeled and unlabeled training data in the training process. In particular, we implement and analyze various semi-supervised learning approaches including a support vector machine (SVM) method facilitated by principal component analysis (PCA), and ...
متن کاملAttention-based Graph Neural Network for Semi-supervised Learning
Recently popularized graph neural networks achieve the state-of-the-art accuracy on a number of standard benchmark datasets for graph-based semi-supervised learning, improving significantly over existing approaches. These architectures alternate between a propagation layer that aggregates the hidden states of the local neighborhood and a fully-connected layer. Perhaps surprisingly, we show that...
متن کاملAccurate Semi-supervised Classification for Graph Data
Most machine learning algorithms require labeled instances as training data; however, not all instances are equally easy to obtain labels for. For example, the best-known papers and/or websites would be easier for a domain expert to label. We propose a new PageRank-style method for performing semi-supervised learning by propagating labels from labeled seed instances to unlabeled instances in a ...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: IEEE Transactions on Knowledge and Data Engineering
سال: 2023
ISSN: ['1558-2191', '1041-4347', '2326-3865']
DOI: https://doi.org/10.1109/tkde.2022.3231660